The Number of Linear Extensions of the Boolean Lattice
نویسندگان
چکیده
Let L(Qt) denote the number of linear extensions of the t-dimensional Boolean lattice Qt. We use the entropy method of Kahn to show that log(L(Qt)) 2t = log ( t bt/2c ) − 3 2 log e + o(1), where the logarithms are base 2. We also find the exact maximum number of linear extensions of a d-regular bipartite order on n elements, in the case when n is a multiple of 2d.
منابع مشابه
ON THE FUZZY SET THEORY AND AGGREGATION FUNCTIONS: HISTORY AND SOME RECENT ADVANCES
Several fuzzy connectives, including those proposed by Lotfi Zadeh, can be seen as linear extensions of the Boolean connectives from the scale ${0,1}$ into the scale $[0,1]$. We discuss these extensions, in particular, we focus on the dualities arising from the Boolean dualities. These dualities allow to transfer the results from some particular class of extended Boolean functions, e.g., from c...
متن کاملLinear Extension Diameter of Downset Lattices of 2-Dimensional Posets
The linear extension diameter of a finite poset P is the maximum distance between a pair of linear extensions of P, where the distance between two linear extensions is the number of pairs of elements of P appearing in different orders in the two linear extensions. We prove a formula for the linear extension diameter of the Boolean Lattice and characterize the diametral pairs of linear extension...
متن کاملLattice of weak hyper K-ideals of a hyper K-algebra
In this note, we study the lattice structure on the class of all weak hyper K-ideals of a hyper K-algebra. We first introduce the notion of (left,right) scalar in a hyper K-algebra which help us to characterize the weak hyper K-ideals generated by a subset. In the sequel, using the notion of a closure operator, we study the lattice of all weak hyper K-ideals of ahyper K-algebra, and we prove a ...
متن کاملDIRECTLY INDECOMPOSABLE RESIDUATED LATTICES
The aim of this paper is to extend results established by H. Onoand T. Kowalski regarding directly indecomposable commutative residuatedlattices to the non-commutative case. The main theorem states that a residuatedlattice A is directly indecomposable if and only if its Boolean center B(A)is {0, 1}. We also prove that any linearly ordered residuated lattice and anylocal residuated lattice are d...
متن کاملThe Number of Linear Extensions of Ranked Posets
We revisit the question of counting the number of linear extensions of the Boolean lattice, relating this to the polyhedral methods of Kahn and Kim, and of Stanley. We give simpler proofs of various known results, and give an upper bound on the number of linear extensions of an arbitrary ranked poset satisfying the LYM condition. [Note: This preprint is not intended for journal publication, as ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Order
دوره 20 شماره
صفحات -
تاریخ انتشار 2003